RNA Accessibility in cubic time
نویسندگان
چکیده
منابع مشابه
Cryptographic Analysis in Cubic Time
The spi-calculus is a variant of the polyadic π-calculus that admits symmetric cryptography and that admits expressing communication protocols in a precise though still abstract way. This paper shows that context-independent control flow analysis can be calculated in cubic time despite the fact that the spi-calculus operates over an infinite universe of values. Our approach is based on Horn Cla...
متن کاملFast accessibility-based prediction of RNA-RNA interactions
MOTIVATION Currently, the best RNA-RNA interaction prediction tools are based on approaches that consider both the inter- and intramolecular interactions of hybridizing RNAs. While accurate, these methods are too slow and memory-hungry to be employed in genome-wide RNA target scans. Alternative methods neglecting intramolecular structures are fast enough for genome-wide applications, but are to...
متن کاملUnrestricted accessibility of short oligonucleotides to RNA.
The propensity of RNA to fold into higher-order structures poses a major barrier to the use of short probes (<15 nucleotides) by preventing their accessibility. Introduction of the pseudo-complementary bases 2-aminoadenine (nA) and 2-thiouracil (sU) and the destabilizing base 7-deazaguanine (cG) into RNA provides a partial solution to this problem. While complementary in hydrogen bonding groups...
متن کاملControl-Flow Analysis in Cubic Time
It is well-known that context-independent control flow analysis can be performed in cubic time for functional and object-oriented languages. Yet recent applications of control flow analysis to calculi of computation (like the π-calculus and the ambient calculus) have reported considerably higher complexities. In this paper we introduce two general techniques, the use of Horn clauses with sharin...
متن کاملN-fold integer programming in cubic time
n-Fold integer programming is a fundamental problem with a variety of natural applications in operations research and statistics. Moreover, it is universal and provides a new, variable-dimension, parametrization of all of integer programming. The fastest algorithm for n-fold integer programming predating the present article runs in time O ( ng(A)L ) with L the binary length of the numerical par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms for Molecular Biology
سال: 2011
ISSN: 1748-7188
DOI: 10.1186/1748-7188-6-3